Fusions of tensor powers of Johnson schemes
نویسندگان
چکیده
This paper is a follow-up to [5], in which the first author studied primitive association schemes lying between tensor power
منابع مشابه
A remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملDerivatives of tensor powers and their norms
The norm of the mth derivative of the map that takes an operator to its kth antisymmetric tensor power is evaluated. The case m = 1 has been studied earlier by Bhatia and Friedland [R. Bhatia and S. Friedland. Variation of Grassman powers and spectra. Linear Algebra and its Applications, 40:1–18, 1981]. For this purpose a multilinear version of a theorem of Russo and Dye is proved: it is shown ...
متن کاملThe Terwilliger algebra of the Johnson schemes
One of the classical families of association schemes is known as the Johnson schemes J (n, d). In this paper we compute the Terwilliger algebra associated to them when 3d n. We give its decomposition into simple ideals and the decomposition of its standard module into irreducible submodules. © 2006 Elsevier B.V. All rights reserved.
متن کاملOn Tensor Powers of Integer Programs
We de ne a natural product on integer programming problems with nonnegative coe cients. Hypergraph covering problems are a special case of such integer programs, and the product we de ne is a generalization of the usual hypergraph product. The main theorem of this paper gives a su cient condition under which the solution to the nth power of an integer program is asymptotically as good as the so...
متن کاملIndependent sets in tensor graph powers
The tensor product of two graphs, G and H, has a vertex set V (G) × V (H) and an edge between (u, v) and (u′, v′) iff both uu′ ∈ E(G) and vv′ ∈ E(H). Let A(G) denote the limit of the independence ratios of tensor powers of G, limα(G)/|V (G)|. This parameter was introduced in [5], where it was shown that A(G) is lower bounded by the vertex expansion ratio of independent sets of G. In this note w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2023
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.271